K-Means Binary Search Centroid With Dynamic Cluster for Java Island Health Clustering

نویسندگان

چکیده

This study is focused on determining the health status of each district/city in Java using K-means Binary Search Centroid and Dynamic Kmeans algorithms. The research data uses profile Island 2020. Comparative algorithms were tested Davies Bound Index Calinski-Harabasz methods traditional k-means algorithm dynamic binary search centroid k-means. Based test, 5 clusters found distribution area, including 11 regions with very high quality cluster 1, 24 quality, 28 moderate 4 low 45 regions, deficient best validation value DBI 1.8175 CHI 67.7868. Overall optimization based results a better average smaller number iterations than algorithm. test can be used as one evaluating level area reference for decision-making policies related agencies

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inter Cluster Distance Management Model with Optimal Centroid Estimation for K-Means Clustering Algorithm

Clustering techniques are used to group up the transactions based on the relevancy. Cluster analysis is one of the primary data analysis method. The clustering process can be done in two ways such that Hierarchical clusters and partition clustering. Hierarchical clustering technique uses the structure and data values. The partition clustering technique uses the data similarity factors. Transact...

متن کامل

Binary Images Clustering with K-means

Nowadays, with the large amount of image databases available, there is the need to access them in the most various and easiest ways. For many applications, an expeditious manner to fulfill such need encompasses partitioning images by their content both for indexing or retrieval purposes. In this paper we propose a method to group binary images in respect to their content by means of an unsuperv...

متن کامل

Determining a Cluster Centroid of K-Means Clustering Using Genetic Algorithm

Clustering is a function of data mining that served to define clusters (groups) of the object in which objects are in one cluster have in common with other objects that are in the same cluster and the object is different from the other objects in different clusters. One method of clustering that can be used is the KMeans Clustering are included in the category of partitioning methods. One of th...

متن کامل

K-Means Clustering using Tabu Search with Quantized Means

The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd’s algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational complexity. Moreover, the difficulty in parameter selection in the existing TS...

متن کامل

Ranking and Clustering Iranian Provinces Based on COVID-19 Spread: K-Means Cluster Analysis

Introduction: The Coronavirus has crossed geographical borders. This study was performed to rank and cluster Iranian provinces based on coronavirus disease (COVID-19) recorded cases from February 19 to March 22, 2020. Materials and Methods: This cross-sectional study was conducted in 31 provinces of Iran using the daily number of confirmed cases. Cumulative Frequency (CF) and Adjusted CF (ACF)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Riset Informatika

سال: 2023

ISSN: ['2656-1735', '2656-1743']

DOI: https://doi.org/10.34288/jri.v5i3.511